consistent hashing造句
造句與例句
手機(jī)版
- Hence consistent hashing is needed to avoid swamping of servers.
- Unlike consistent hashing, HRW requires no precomputing or storage of tokens.
- The SHA-1 algorithm is the base hashing function for consistent hashing.
- Consistent hashing maps objects to the same cache machine, as far as possible.
- The consistent hashing concept also applies to the design of distributed hash tables ( DHTs ).
- Consistent hashing achieves some of the same goals as rendezvous hashing ( also called HRW Hashing ).
- Consistent hashing operates by mapping sites uniformly and randomly to points on a unit circle called tokens.
- Consistent hashing could be considered a composite of hash and list partitioning where the hash reduces the key space to a size that can be listed.
- DHTs use consistent hashing to partition a keyspace among a distributed set of nodes, and additionally provide an overlay network that connects nodes such that the node responsible for any key can be efficiently located.
- Both consistent hashing and rendezvous hashing have the essential property that removal or addition of one node changes only the set of keys owned by the nodes with adjacent IDs, and leaves all other nodes unaffected.
- It's difficult to see consistent hashing in a sentence. 用consistent hashing造句挺難的
- Consistent hashing is integral to the robustness and performance of Chord because both keys and nodes ( in fact, their IP addresses ) are uniformly distributed in the same identifier space with a negligible possibility of collision.
- It is not possible, however, to reduce HRW to consistent hashing ( assuming the number of tokens per site is bounded ), since HRW potentially reassigns the objects from a removed site to an unbounded number of other sites.
- Variants of consistent hashing ( such as Amazon's Dynamo ) that use more complex logic to distribute tokens on the unit circle offer better load balancing, further reduce the overhead of adding new sites, and reduce metadata overhead while offering other benefits.
- For example, the Chord DHT uses consistent hashing, which treats keys as points on a circle, and \ delta ( k _ 1, k _ 2 ) is the distance traveling clockwise around the circle from k _ 1 to k _ 2.
- Consistent hashing appears to have been devised around the same time at MIT . One of the first applications of rendezvous hashing was to enable multicast clients on the Internet ( in contexts such as the MBONE ) to identify multicast rendezvous points in a distributed fashion.
- Even with many tokens per site, however, the basic version of consistent hashing may not balance objects uniformly over sites, since when a site is removed each object assigned to it is distributed only over as many other sites as the site has tokens ( say 100-200 ).
- The main idea behind the consistent hashing algorithm is to associate each cache with one or more hash value intervals where the interval boundaries are determined by calculating the hash of each cache identifier . ( The hash function used to define the intervals does not have to be the same function used to hash the cached values.
- Much of the news was positive; a problem with caching server stability has been fixed, and freeing up memory on the WMF's application servers " addresses some of the root causes of multiple site outages, and brings with it multiple client improvements including consistent hashing, igbinary serialization, and better timeout handling ".
如何用consistent hashing造句，用consistent hashing造句，consistent hashing in a sentence, 用consistent hashing造句和consistent hashing的例句由查查漢語(yǔ)詞典提供，版權(quán)所有違者必究。